Absorption in Universal Algebra and CSP
نویسندگان
چکیده
The algebraic approach to Constraint Satisfaction Problem led to many developments in both CSP and universal algebra. The notion of absorption was successfully applied on both sides of the connection. This article introduces the concept of absorption, illustrates its use in a number of basic proofs and provides an overview of the most important results obtained by using it. 1998 ACM Subject Classification G.2.1. Combinatorics
منابع مشابه
Polymorphisms, and How to Use Them
This article describes the algebraic approach to Constraint Satisfaction Problem that led to many developments in both CSP and universal algebra. No prior knowledge of universal algebra is assumed. 1998 ACM Subject Classification F.2.0 [Analysis of Algorithms and Problem Complexity] General, F.2.0 [Discrete Mathematics] General
متن کاملThe universal $mathcal{AIR}$- compactification of a semigroup
In this paper we establish a characterization of abelian compact Hausdorff semigroups with unique idempotent and ideal retraction property. We also introduce a function algebra on a semitopological semigroup whose associated semigroup compactification is universal withrespect to these properties.
متن کاملNon-negative Weighted #CSPs: An Effective Complexity Dichotomy
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms [19, 8, 18, 12] and the celebrated dichotomy theorem for unweighted #CSP [6, 4, 21, 22]. Our dichotomy theorem gives a succinct criterion for tractability. If...
متن کاملFuzzy universal algebras on $L$-sets
This paper attempts to generalize universal algebras on classical sets to $L$-sets when $L$ is a GL-quantale. Some basic notions of fuzzy universal algebra on an $L$-set are introduced, such as subalgebra, quotient algebra, homomorphism, congruence, and direct product etc. The properties of them are studied. $L$-valued power algebra is also introduced and it is shown there is an onto homomorphi...
متن کاملThe Complexity of Temporal Constraint Languages
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal constraint languages, then the CSP can be solved in pol...
متن کامل